Greedy routing in small-world networks with power-law degrees
نویسندگان
چکیده
منابع مشابه
The Power of Lookahead in Small-World Routing Networks
Topologies and routing protocols for peer-to-peer networks have witnessed a flurry of research activity recently. Almost all designs employ greedy routing in one form or the other. Randomized topologies that are currently under investigation fall into two categories: (a) small-world network topologies based upon Kleinberg’s construction [Kle00], and (b) randomized variants of deterministic topo...
متن کاملGreedy Routing and the Algorithmic Small-World Phenomenon
The algorithmic small-world phenomenon, empirically established by Milgram’s letter forwarding experiments from the 60s [47], was theoretically explained by Kleinberg in 2000 [36]. However, from today’s perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation of the algorithmic small-world phenomeno...
متن کاملGreedy Routing and the Algorithmic Small-World Phenomenom
The algorithmic small-world phenomenon, empirically established by Milgram’s letter forwarding experiments from the 60s [59], was theoretically explained by Kleinberg in 2000 [46]. However, from today’s perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation of the algorithmic small-world phenomeno...
متن کاملDistributed Routing in Small-World Networks
So called small-world networks – clustered networks with small diameters – are thought to be prevalent in nature, especially appearing in people’s social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between nodes in such networks. Searching for such routes, however, always depends on nodes knowing what their...
متن کاملEfficient routing in Poisson small-world networks
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power, r−α, of the distance r between them. Kleinberg showed that greedy routing is efficient if α = d and that there is no efficient decentralised routing algorithm if α 6= d. The results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2014
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-014-0210-y